Self-avoiding walks and polygons on the triangular lattice
نویسنده
چکیده
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40 we also calculate series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and the mean-square distance of a monomer from the end points. For self-avoiding polygons to length 58 we calculate series for the meansquare radius of gyration and the first 10 moments of the area. Analysis of the series yields accurate estimates for the connective constant of triangular self-avoiding walks, μ = 4.150797226(26), and confirms to a high degree of accuracy several theoretical predictions for universal critical exponents and amplitude combinations. Self-avoiding walks and polygons on the triangular lattice 2
منابع مشابه
S ep 2 00 4 Self - avoiding walks and polygons on the triangular lattice
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40 we also calculate series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and the mean-square distance of a monome...
متن کاملHoneycomb lattice polygons and walks as a test of series analysis techniques
We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution for polygons. Analysis of the series yields accurate estimates for the connective constant, critical exponents and amplitudes of honeycomb self-avoiding walks...
متن کاملExact solution of two classes of prudent polygons
Prudent walks are self-avoiding walks on a lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent polygons, where the last vertex of the walk is adjacent to its first one. More precisely, we give the half-perimeter generating functions of two subclasses of prudent polygons on the square lattice, which turn out to be ...
متن کاملSelf-avoiding walks and trails on the 3.12 lattice
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...
متن کاملSelf-avoiding walks and polygons on quasiperiodic tilings
We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices, these numbers depend on the chosen initial vertex. We compare different ways of counting and demonstrate that suitable averaging improves convergence to the asym...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004